On the Independence Number of Some Strong Products of Cycle-powers
نویسندگان
چکیده
In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C 10) ) = 30 and α((C 14) ) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish new exact values and/or lower bounds on the Shannon capacity of noisy channels.
منابع مشابه
Asteroidal number for some product graphs
The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples to asteroidal sets [8]. Further study was carried out by Haiko Muller [4]. In this paper we find asteroidal numbers for Direct product of cycles, Direct product of path and cy...
متن کاملAn Inventory Model for Obsolescence Items with Consideration of Permissible Delay in Payments (Case Study of Obsolete Medicines in Pharmacies)
Background and Objectives: In the real world, the obsolescence items are some items that lose their value over time due to the emergence of new technology. Because of rapid changes in technology, inventory management of such items is considered in recent years. Moreover, suppliers try to encourage the retailers for purchasing an item before it is outmoded with some policies suc...
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملPricing in a two-echelon supply chain with different market powers: game theory approaches
In this research, the optimal pricing decisions for two complementary products in a two-echelon supply chain under two scenarios are studied. The proposed supply chain in each echelon includes one retailer and two manufacturers and the same complementary products are produced. In the first scenario, we assume the unit manufacturing costs of the complementary products in each echelon are the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015